LEFT-TO-RIGHT MULTIPLICATION FOR MONOTONE BOOLEAN DUALIZATIONBOROS, Endre; ELBASSIONI, Khaled; MAKINO, Kazuhisa et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3424-3439, issn 0097-5397, 16 p.Article

Reconstructing chain functions in genetic networksGAT-VIKS, Irit; KARP, Richard M; SHAMIR, Ron et al.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 3, pp 727-740, issn 0895-4801, 14 p.Article

Balanced 2p-variable rotation symmetric Boolean functions with maximum algebraic immunitySHAOJING FU; CHAO LI; MATSUURA, Kanta et al.Applied mathematics letters. 2011, Vol 24, Num 12, pp 2093-2096, issn 0893-9659, 4 p.Article

On affine (non)equivalence of Boolean functionsGANGOPADHYAY, Sugata; SHARMA, Deepmala; SARKAR, Sumanta et al.Computing (Wien. Print). 2009, Vol 85, Num 1-2, pp 37-55, issn 0010-485X, 19 p.Article

Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classesZVEROVICH, Igor E.Discrete applied mathematics. 2005, Vol 149, Num 1-3, pp 200-218, issn 0166-218X, 19 p.Article

Influences of monotone Boolean functionsCHRISTOFIDES, Demetres.Discrete mathematics. 2010, Vol 310, Num 8, pp 1401-1402, issn 0012-365X, 2 p.Article

Equivalence of operations with respect to discriminator clonesLEHTONEN, Erkko; SZENDREI, Agnes.Discrete mathematics. 2009, Vol 309, Num 4, pp 673-685, issn 0012-365X, 13 p.Article

The Generalized XOR LemmaYULIANG ZHENG; ZHANG, Xian-Mo.Theoretical computer science. 2004, Vol 329, Num 1-3, pp 331-337, issn 0304-3975, 7 p.Article

Duality between bent functions and affine functionsTOKAREVA, Natalia.Discrete mathematics. 2012, Vol 312, Num 3, pp 666-670, issn 0012-365X, 5 p.Conference Paper

Boolean inequationsBANKOVIC, Dragic.Discrete mathematics. 2007, Vol 307, Num 6, pp 750-755, issn 0012-365X, 6 p.Article

Laced Boolean functions and subset sum problems in finite fieldsCANRIGHT, David; GANGOPADHYAY, Sugata; MAITRA, Subhamoy et al.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1059-1069, issn 0166-218X, 11 p.Article

A well-mixed function with circuit complexity 5n: Tightness of the Lachish―Raz-type boundsAMANO, Kazuyuki; JUN TARUI.Theoretical computer science. 2011, Vol 412, Num 18, pp 1646-1651, issn 0304-3975, 6 p.Conference Paper

Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunityRIZOMILIOTIS, Panagiotis.Discrete applied mathematics. 2010, Vol 158, Num 18, pp 2049-2055, issn 0166-218X, 7 p.Article

Regular symmetric groups of boolean functionsGRECH, Mariusz.Discrete mathematics. 2010, Vol 310, Num 21, pp 2877-2882, issn 0012-365X, 6 p.Article

TESTING HALFSPACESMATULEF, Kevin; O'DONNELL, Ryan; RUBINFELD, Ronitt et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 2004-2047, issn 0097-5397, 44 p.Article

Reasoning about faulty quantum programsZULIANI, Paolo.Acta informatica. 2009, Vol 46, Num 6, pp 403-432, issn 0001-5903, 30 p.Article

Using a similarity measure for credible classificationSUBASI, M; SUBASI, E; ANTHONY, M et al.Discrete applied mathematics. 2009, Vol 157, Num 5, pp 1104-1112, issn 0166-218X, 9 p.Article

A novel algorithm enumerating bent functionsQINGSHU MENG; MIN YANG; HUANGUO ZHANG et al.Discrete mathematics. 2008, Vol 308, Num 23, pp 5576-5584, issn 0012-365X, 9 p.Article

An improvement on the complexity of factoring read-once Boolean functionsGOLUMBIC, Martin Charles; MINTZ, Aviad; ROTICS, Udi et al.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1633-1636, issn 0166-218X, 4 p.Article

ON THE DISTRIBUTION OF KLOOSTERMAN SUMSSHPARLINSKI, Igor E.Proceedings of the American Mathematical Society. 2008, Vol 136, Num 2, pp 419-425, issn 0002-9939, 7 p.Article

LOWER BOUNDS FOR RANDOMIZED AND QUANTUM QUERY COMPLEXITY USING KOLMOGOROV ARGUMENTSLAPLANTE, Sophie; MAGNIEZ, Frédéric.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 46-62, issn 0097-5397, 17 p.Article

A bound on the precision required to estimate a boolean perceptron from its average satisfying assignmentGOLDBERG, Paul W.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 2, pp 328-343, issn 0895-4801, 16 p.Article

A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitationJANSEN, Thomas; WEGENER, Ingo.Theoretical computer science. 2007, Vol 386, Num 1-2, pp 73-93, issn 0304-3975, 21 p.Article

Bounds on the fourier coefficients of the weighted sum functionSHPARLINSKI, Igor E.Information processing letters. 2007, Vol 103, Num 3, pp 83-87, issn 0020-0190, 5 p.Article

Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptographyLASKARI, E. C; MELETIOU, G. C; STAMATIOU, Y. C et al.Mathematical and computer modelling. 2007, Vol 46, Num 1-2, pp 174-179, issn 0895-7177, 6 p.Conference Paper